Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Star
نویسندگان
چکیده
منابع مشابه
Signed Dominating and Total Dominating Functions of Corona Product Graph of a Path with a Star
Domination in graphs has been an extensively researched branch of graph theory. Graph theory is one of the most flourishing branches of modern mathematics and computer applications. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [ 1, 2]. Recently dominating functions in domination theory have receiv...
متن کاملConvexity of Minimal Dominating and Total Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [1,2]. Product of graphs occurs naturally in discrete mathematics as tools in combinatorial constructions. They give rise to an importa...
متن کاملConvexity of Minimal Dominating and Total Dominating Functions of Corona Product Graph of a Path with a Star
‘Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [1,2]. Product of graphs occurs naturally in discrete mathematics as tools in combinatorial constructions. They give rise to an import...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
The edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2019
ISSN: 0975-8887
DOI: 10.5120/ijca2019918975